DSPACE[nk] = VAR[k+1]

نویسنده

  • Neil Immerman
چکیده

In this paper we prove that the set of properties check-able by a Turing machine in DSPACEn k ] is exactly equal to the set of properties describable by a uniform sequence of rst-order sentences using at most k + 1 distinct variables. We prove that this is also equal to the set of properties describable using an iterative definition for a nite set of relations of arity k. This is a reenement of the theorem PSPACE = VARRO1]] I82]. We suggest some directions for exploiting this result to derive trade-oos between the number of variables and the quantiier-depth in desciptive complexity. This has applications to parallel complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle

In this paper, we study different variations of minimum width color-spanning annulus problem among a set of points P = {p1, p2, . . . , pn} in IR, where each point is assigned with a color in {1, 2, . . . , k}. We present algorithms for finding a minimum width color-spanning axis parallel square annulus (CSSA), minimum width color spanning axis parallel rectangular annulus (CSRA), and minimum w...

متن کامل

New Frontiers in Applied Probability

Suppose that N is a Z+-valued random variable and that X,X1, X2, . . . is a sequence of independent and identically distributed Z+ random variables independent of N . In this paper we are interested in properties of the conditional variable Nk D =(N | ∑Nj=1 Xj = k). In particular, we want to know the asymptotic behavior of the conditional mean ENk or the conditional variance var Nk as k → ∞. We...

متن کامل

Improving the Applicability of Adaptive Consistency: Preliminary Results

ADC • ADC is the reference algorithm to solve CSP by complete inference • ADC is a specialization of bucket elimination, a more general algorithm used in optimization • The time and space complexity of ADC are exponential on the problem induced width w∗. • ADC follows a Dynamic Programming schema and computes all solutions • Two basic operations: • Join. c 1 r is a new constraint with scope var...

متن کامل

A new real time approach using dSPACE R&D Controller Board for reactive power control by SVC in autonomous wind-diesel hybrid power systems

This paper presents the reactive power control of Autonomous Wind-Diesel Hybrid Power Systems (AWDHPS) under dSPACE real time environment. The reactive power absorption and supply is done by a Static VAR Compensator (SVC) controlled by proportional plus integral controller and tuned by dSPACE DS 1104. Three models of AWDHPS are considered in the study. The disturbance parameters in the models w...

متن کامل

On the Uniform Generation of Modular Diagrams

In this paper we present an algorithm that generates k-noncrossing, σ-modular diagrams with uniform probability. A diagram is a labeled graph of degree ≤ 1 over n vertices drawn in a horizontal line with arcs (i, j) in the upper half-plane. A k-crossing in a diagram is a set of k distinct arcs (i1, j1), (i2, j2), . . . , (ik, jk) with the property i1 < i2 < . . . < ik < j1 < j2 < . . . < jk. A ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991